On the dominant set selection problem and its application to value alignment

Abstract Decision makers can often be confronted with the need to select a subset of objects from set candidate by just counting on preferences regarding objects’ features. Here we formalise this problem as dominant selection . Solving amounts finding over all possible sets objects. We accomplish so by: (i) grounding features themselves; and (ii) lifting these This is achieved combining lex-cel –a method literature—with our novel anti-lex-cel method, which formally (and thoroughly) study. Furthermore, provide binary integer program encoding solve problem. Finally, illustrate overall approach applying it value-aligned norm systems.